Existence of nonnegative solutions for second order m-point boundary value problems at resonance

In this paper, the minimal and maximal nonnegative solutions for second order m-point boundary value problems at resonance are investigated by using a new fixed point theorem of increasing operators. And the monotone iterative sequences which converge to solutions are given. The method is different essentially from the previous papers used by coincidence degree continuation theorem of Mawhin.     

LARGE DEVIATIONS AND MODERATE DEVIATIONS FOR SUMS OF NEGATIVELY DEPENDENT RANDOM VARIABLES

In this article, we obtain the large deviations and moderate deviations for negatively dependent (ND) and non-identically distributed random variables defined on (-∞, +∞). The results show that for some non-identical random variables, precise large deviations and moderate deviations remain insensitive to negative dependence structure.     

带正则*-断面的正则半群

本文给出了带正则*-断面的正则半群的若干性质,获得了带拟理想正则*-断面的正则半群的一个构造方法.利用这一构造定理,考虑了这类半群上的同余.     

奇异积分和位势积分交换子在极大Morrey空间上的有界性

设齐次空间(X,ρ,μ)上定义一类极大Morrey空间L~(p),θ,λ)(X,μ).此类极大Morrey空间是经典的Morrey空间和极大Lebesgue空间的推广.本文考虑了C-Z积分算子、位势算子与BMO函数生成的交换子在该类极大Morrey空间上的有界性.事实上,这些结果甚至在一般的欧式空间上也是新颖的.     

恰有两个子群共轭类长的有限群

设G是有限群,Ns(G)表示G的子群共轭类长构成的集合.本文研究Ns(G)中只有两个元素时有限群G的结构,在非幂零情形时给出了G的完全分类,在幂零情形时获得了G的一些性质.     

有限个平衡问题与非扩张映象不动点问题的复合迭代方法

在Hilbert空间中引进并研究一种新的复合粘性迭代算法,借以寻求有限个平衡问题的公共解集与非扩张映象不动点集的一个公共元素.所得结果改进并推广了最近一些人的最新结果.     

A sufficient descent LS conjugate gradient method for unconstrained optimization problems

In this paper, we make a modification to the Liu-Storey (LS) conjugate gradient method and propose a descent LS method. The method can generate sufficient descent directions for the objective function. This property is independent of the line search used. We prove that the modified LS method is globally convergent with the strong Wolfe line search. The numerical results show that the proposed descent LS method is efficient for the unconstrained problems in the CUTEr library.     

Single machine scheduling with total tardiness criterion and convex controllable processing times

We consider a single machine scheduling problem with total tardiness criteria and controllable job-processing times specified by a convex resource consumption function. The objective is to have the total tardiness limited into a given range, and minimize the total resource consumption. A polynomial time algorithm of O(n ²) is presented for the special case where jobs have a common due date.     

Bending and vibration of an electrostatically actuated circular microplate in presence of Casimir force

The pull-in instability and the vibration for a prestressed circular electrostatically actuated microplate are investigated in consideration of the Casimir force. Based on von Kármán’s nonlinear bending theory of thin plates, the governing equations for the whole analysis are decomposed into two two-point boundary value problems. For static deformation of the plate, the geometric nonlinearity is involved and the pull-in parameters are obtained by using the shooting method through taking the applied voltage or Casimir parameter as an unknown. This algorithm is also used to study the small amplitude free vibration about the predeformed bending configuration following an assumed harmonic time mode, and the variation of the prestress and Casimir parameters dependent fundamental natural frequency with the applied voltage is presented. Several case studies are compared with available published simulations to confirm the proposed method. The influences of various parameters, such as the initial gap-thickness ratio, Casimir effect, prestress on the pull-in instability behavior and the natural frequency are examined.     

Constructing C1 triangular patch of degree six by the Boolean sum of an approximation operator and an interpolation operator

A new method to construct C¹ triangular patches which satisfy the given boundary curves and cross-boundary slopes is presented. The Boolean sum of an approximation operator and an interpolation operator is employed to construct the triangular patch. The approximation operator is used to construct a polynomial patch of degree six. The polynomial of degree six affords more freedoms, which makes the approximation operator not only approximate the given boundary interpolation conditions but also have a better approximation precision in the interior of the triangle, so that the triangular patch has a better precision on both the boundary and the interior of the triangular domain. The interpolation operator is utilized to build an interpolation patch which satisfies the given boundary conditions. The Boolean sum of the approximation and interpolation patches forms the triangular patch. Comparison results of the new method with other three methods are given.